package com.example.leetcode.math;

import com.example.leetcode.math.common.MathUtils;

class Solution628 {
    public int maximumProduct(int[] nums) {
        return MathUtils.maximumProduct(nums);
    }
}

public class leetcode628 {
    public static void main(String[] args) {
        Solution628 solution628 = new Solution628();
        int[] nums = {1, 2, 3, 4};
        int[] nums1 = {-1, 2, 3, 4};
        int[] nums2 = {-1, -2, 3, 4};
        int[] nums3 = {-1, -2, -3, 4};
        int[] nums4 = {-7, -2, -3, 4, 3, 6, 7};
        int[] nums5 = {-1, -2, 5, 6, 7, -3, 4};
        System.out.println(solution628.maximumProduct(nums));
        System.out.println(solution628.maximumProduct(nums1));
        System.out.println(solution628.maximumProduct(nums2));
        System.out.println(solution628.maximumProduct(nums3));
        System.out.println(solution628.maximumProduct(nums4));
        System.out.println(solution628.maximumProduct(nums5));
    }
}
